Work-family attitudes and behaviours among newly immigrant Pakistani expatriates: the role of organizational family-friendly policies

The work-life interface literature is often criticized for its limited sample base, with the majority of research focusing on the experiences of white women living in nuclear family households in Western societies. This paper aims to address some of these criticisms by using a qualitative methodology to explore the impact of organizational family-friendly policies on the work-family attitudes and behaviours of 26 newly expatriate Pakistani employees in the United Kingdom. Individual, family, and religious/cultural influences on these outcomes were also explored. Findings indicate that study participants undergo a shift of priorities that result from expatriation and the consequent attenuation of extended family and societal pressures to have children immediately after marriage; participants are delaying childbirth in order to gain educational qualifications and establish careers in a foreign country. A strong preference for familial childcare suggests that family-friendly policies such as part-time or flexible hours have the potential to significantly affect employment outcomes for Pakistani expatriate women, who, in the absence of extended family to provide care for children, might not otherwise return to work following childbirth. Other potential organizational interventions are also discussed

Measured Quantum Fourier Transform of 1024 Qubits on Fiber Optics

Quantum Fourier transform (QFT) is a key function to realize quantum computers. A QFT followed by measurement was demonstrated on a simple circuit based on fiber-optics. The QFT was shown to be robust against imperfections in the rotation gate. Error probability was estimated to be 0.01 per qubit, which corresponded to error-free operation on 100 qubits. The error probability can be further reduced by taking the majority of the accumulated results. The reduction of error probability resulted in a successful QFT demonstration on 1024 qubits.Comment: 15 pages, 6 figures, submitted to EQIS 2003 Special issue, Int. J. Quantum Informatio

Scalability of Shor's algorithm with a limited set of rotation gates

Typical circuit implementations of Shor's algorithm involve controlled rotation gates of magnitude $\pi/2^{2L}$ where $L$ is the binary length of the integer N to be factored. Such gates cannot be implemented exactly using existing fault-tolerant techniques. Approximating a given controlled $\pi/2^{d}$ rotation gate to within $\delta=O(1/2^{d})$ currently requires both a number of qubits and number of fault-tolerant gates that grows polynomially with $d$. In this paper we show that this additional growth in space and time complexity would severely limit the applicability of Shor's algorithm to large integers. Consequently, we study in detail the effect of using only controlled rotation gates with $d$ less than or equal to some $d_{\rm max}$. It is found that integers up to length $L_{\rm max} = O(4^{d_{\rm max}})$ can be factored without significant performance penalty implying that the cumbersome techniques of fault-tolerant computation only need to be used to create controlled rotation gates of magnitude $\pi/64$ if integers thousands of bits long are desired factored. Explicit fault-tolerant constructions of such gates are also discussed.Comment: Substantially revised version, twice as long as original. Two tables converted into one 8-part figure, new section added on the construction of arbitrary single-qubit rotations using only the fault-tolerant gate set. Substantial additional discussion and explanatory figures added throughout. (8 pages, 6 figures

Listen carefully: transgender voices in the workplace

We find that only 17% of FTSE 100 company websites refer directly to transgender (‘trans’) individuals, illustrating the extent to which trans voices are unheard in the workplace. We propose that these voices are missing for a number of reasons: voluntary silence to protect oneself from adverse circumstances; the subsumption of trans voices within the larger ‘LGBT’ community; assimilation, wherein many trans voices become affiliated with those of their post-transition gender; multiple trans voices arising from diversity within the transgender community; and limited access to voice mechanisms for transgender employees. We identify the negative implications of being unheard for individual trans employees, for organizational outcomes, and for business and management scholarship, and propose ways in which organizations can listen more carefully to trans voices. Finally, we introduce an agenda for future research that tests the applicability of the theoretical framework of invisible stigma disclosure to transgender individuals, and calls for new theoretical and empirical developments to identify HRM challenges and best practices for respecting trans employees and their choices to remain silent or be heard

Statistical Assertions for Validating Patterns and Finding Bugs in Quantum Programs

In support of the growing interest in quantum computing experimentation, programmers need new tools to write quantum algorithms as program code. Compared to debugging classical programs, debugging quantum programs is difficult because programmers have limited ability to probe the internal states of quantum programs; those states are difficult to interpret even when observations exist; and programmers do not yet have guidelines for what to check for when building quantum programs. In this work, we present quantum program assertions based on statistical tests on classical observations. These allow programmers to decide if a quantum program state matches its expected value in one of classical, superposition, or entangled types of states. We extend an existing quantum programming language with the ability to specify quantum assertions, which our tool then checks in a quantum program simulator. We use these assertions to debug three benchmark quantum programs in factoring, search, and chemistry. We share what types of bugs are possible, and lay out a strategy for using quantum programming patterns to place assertions and prevent bugs.Comment: In The 46th Annual International Symposium on Computer Architecture (ISCA '19). arXiv admin note: text overlap with arXiv:1811.0544

A Quantitative Measure of Interference

We introduce an interference measure which allows to quantify the amount of interference present in any physical process that maps an initial density matrix to a final density matrix. In particular, the interference measure enables one to monitor the amount of interference generated in each step of a quantum algorithm. We show that a Hadamard gate acting on a single qubit is a basic building block for interference generation and realizes one bit of interference, an ``i-bit''. We use the interference measure to quantify interference for various examples, including Grover's search algorithm and Shor's factorization algorithm. We distinguish between ``potentially available'' and ``actually used'' interference, and show that for both algorithms the potentially available interference is exponentially large. However, the amount of interference actually used in Grover's algorithm is only about 3 i-bits and asymptotically independent of the number of qubits, while Shor's algorithm indeed uses an exponential amount of interference.Comment: 13 pages of latex; research done at http://www.quantware.ups-tlse.fr

Effects of imperfections for Shor's factorization algorithm

We study effects of imperfections induced by residual couplings between qubits on the accuracy of Shor's algorithm using numerical simulations of realistic quantum computations with up to 30 qubits. The factoring of numbers up to N=943 show that the width of peaks, which frequencies allow to determine the factors, grow exponentially with the number of qubits. However, the algorithm remains operational up to a critical coupling strength $\epsilon_c$ which drops only polynomially with $\log_2 N$. The numerical dependence of $\epsilon_c$ on $\log_2 N$ is explained by analytical estimates that allows to obtain the scaling for functionality of Shor's algorithm on realistic quantum computers with a large number of qubits.Comment: 10 pages, 10 figures, 1 table. Added references and new data. Erratum added as appendix. 1 Figure and 1 Table added. Research is available at http://www.quantware.ups-tlse.fr

Assessing the climate change impacts of biogenic carbon in buildings: a critical review of two main dynamic approaches

Wood is increasingly perceived as a renewable, sustainable building material. The carbon it contains, biogenic carbon, comes from biological processes; it is characterized by a rapid turnover in the global carbon cycle. Increasing the use of harvested wood products (HWP) from sustainable forest management could provide highly needed mitigation efforts and carbon removals. However, the combined climate change benefits of sequestering biogenic carbon, storing it in harvested wood products and substituting more emission-intensive materials are hard to quantify. Although different methodological choices and assumptions can lead to opposite conclusions, there is no consensus on the assessment of biogenic carbon in life cycle assessment (LCA). Since LCA is increasingly relied upon for decision and policy making, incorrect biogenic carbon assessment could lead to inefficient or counterproductive strategies, as well as missed opportunities. This article presents a critical review of biogenic carbon impact assessment methods, it compares two main approaches to include time considerations in LCA, and suggests one that seems better suited to assess the impacts of biogenic carbon in buildings